A sharp concentration inequality with applications

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A sharp concentration inequality with applications

We present a new general concentration-of-measure inequality and illustrate its power by applications in random combinatorics. The results nd direct applications in some problems of learning theory. The work of the second author was supported by DGES grant PB96-0300

متن کامل

A Sharp Inequality and Its Applications

We establish an analog Hardy inequality with sharp constant involving exponential weight function. The special case of this inequality (for n = 2) leads to a direct proof of Onofri inequality on S.

متن کامل

A Linear Programming Inequality with Applications to Concentration of Measure

Over the past decade there has been a flurry of new concentration of measure inequalities; we refer the reader to [4] for an in-depth survey, or [2, 3, 5] for some more recent advances. In [2] the martingale difference method was employed in a novel way to obtain a general concentration inequality for dependent random variables, with respect to the (unweighted) Hamming metric. At the core of th...

متن کامل

A Sharp Double Inequality Involving Trigonometric Functions and Its Applications

We present the best possible parameters p,q ∈ (0,1] such that the double inequality 1 3p2 cos(px)+ 1− 1 3p2 < sin(x) x < 1 3q2 cos(qx)+ 1− 1 3q2 holds for all x ∈ (0,π/2) . As applications, some new inequalities for the sine integral, Catalan constant and Schwab-Borchardt mean are found. Mathematics subject classification (2010): 26D05, 26E60.

متن کامل

Double Logarithmic Inequality with a Sharp Constant

We prove a Log Log inequality with a sharp constant. We also show that the constant in the Log estimate is “almost” sharp. These estimates are applied to prove a Moser-Trudinger type inequality for solutions of a 2D wave equation.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Random Structures and Algorithms

سال: 2000

ISSN: 1042-9832,1098-2418

DOI: 10.1002/(sici)1098-2418(200005)16:3<277::aid-rsa4>3.0.co;2-1